Largest subgraph from a hereditary property in a random graph
نویسندگان
چکیده
Let P be a non-trivial hereditary property of graphs and let k the minimum chromatic number graph that does not belong to P. We prove that, for every fixed p∈(0,1), maximum possible edges in subgraph random G(n,p) which belongs is, with high probability,(1−1k−1+o(1))p(n2).
منابع مشابه
What is the furthest graph from a hereditary property?
For a graph property P, the edit distance of a graph G from P, denoted EP(G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in order to turn it into a graph satisfying P. What is the furthest graph on n vertices from P and what is the largest possible edit distance from P? Denote this maximal distance by ed(n,P). This question is motivated by algor...
متن کاملThe Spectral Gap of a Random Subgraph of a Graph
We examine the relationship of a graph G and its random subgraphs which are defined by independently choosing each edge with probability p. Suppose that G has a spectral gap λ (in terms of its normalized Laplacian) and minimum degree dmin. Then we can show that a random subgraph of G on n vertices with edge-selection probability p almost surely has as its spectral gap λ−O (√ logn pdmin + (logn)...
متن کاملDistribution of the Size of a Largest Planar Matching and Largest Planar Subgraph in Random Bipartite Graphs
We address the following question: When a randomly chosen regular bipartite multi–graph is drawn in the plane in the “standard way”, what is the distribution of its maximum size planar matching (set of non–crossing disjoint edges) and maximum size planar subgraph (set of non–crossing edges which may share endpoints)? The problem is a generalization of the Longest Increasing Sequence (LIS) probl...
متن کاملTowards the Distribution of the Size of a Largest Planar Matching and Largest Planar Subgraph in Random Bipartite Graphs
We address the following question: When a randomly chosen regular bipartite multi– graph is drawn in the plane in the “standard way”, what is the distribution of its maximum size planar matching (set of non–crossing disjoint edges) and maximum size planar subgraph (set of non–crossing edges which may share endpoints)? The problem is a generalization of the Longest Increasing Sequence (LIS) prob...
متن کاملOn the Largest Eigenvalue of a Random Subgraph of the Hypercube
Let G be a random subgraph of the n-cube where each edge appears randomly and independently with probability p. We prove that the largest eigenvalue of the adjacency matrix of G is almost surely λ1(G) = (1 + o(1))max ( 1/2(G), np ) , where (G) is the maximum degree ofG and theo(1) term tends to zero as max( 1/2(G), np) tends to infinity.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2023
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2023.113480